Node / meshtastic / Meshtastic-Android / files / core / model / src / commonTest / kotlin / org / meshtastic / core / model / RouteDiscoveryTest.kt

Displaying Raw • Download

T8b949e/*

* Copyright (c) 2026 Meshtastic LLC

*

* This program is free software: you can redistribute it and/or modify

* it under the terms of the GNU General Public License as published by

* the Free Software Foundation, either version 3 of the License, or

* (at your option) any later version.

*

* This program is distributed in the hope that it will be useful,

* but WITHOUT ANY WARRANTY; without even the implied warranty of

* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the

* GNU General Public License for more details.

*

* You should have received a copy of the GNU General Public License

* along with this program. If not, see <https://www.gnu.org/licenses/>.

*/

Tff7b72package T7ee787org.meshtastic.core.model

Tff7b72import T7ee787kotlin.test.Test

Tff7b72import T7ee787kotlin.test.assertEquals

T8b949e/**

* Tests for [evaluateTracerouteMapAvailability] — the pure function that determines whether a traceroute can be

* visualised on a map based on node position data.

*/

Tf0883e@SuppressTb4b4b4(Ta5d6ff"Ta5d6ffMagicNumberTa5d6ff"Tb4b4b4)

Tff7b72class T56d364RouteDiscoveryTest Tb4b4b4{

Tf0883e@Test

Tff7b72fun Td2a8ffok_whenAllNodesHavePositionsTb4b4b4(Tb4b4b4) Tb4b4b4{

Tff7b72val Te6edf3forward Tff7b72= Te6edf3listOfTb4b4b4(T79c0ff1Tb4b4b4, T79c0ff2Tb4b4b4, T79c0ff3Tb4b4b4)

Tff7b72val Te6edf3back Tff7b72= Te6edf3listOfTb4b4b4(T79c0ff3Tb4b4b4, T79c0ff2Tb4b4b4, T79c0ff1Tb4b4b4)

Tff7b72val Te6edf3positioned Tff7b72= Te6edf3setOfTb4b4b4(T79c0ff1Tb4b4b4, T79c0ff2Tb4b4b4, T79c0ff3Tb4b4b4)

Tff7b72val Te6edf3result Tff7b72= Te6edf3evaluateTracerouteMapAvailabilityTb4b4b4(Te6edf3forwardTb4b4b4, Te6edf3backTb4b4b4, Te6edf3positionedTb4b4b4)

Te6edf3assertEqualsTb4b4b4(Te6edf3TracerouteMapAvailabilityTb4b4b4.Te6edf3OkTb4b4b4, Te6edf3resultTb4b4b4)

Tb4b4b4}

Tf0883e@Test

Tff7b72fun Td2a8ffok_whenEndpointsPositioned_andIntermediateNotTb4b4b4(Tb4b4b4) Tb4b4b4{

T8b949e// Endpoints (1 and 3) are positioned, intermediate (2) is not

Tff7b72val Te6edf3forward Tff7b72= Te6edf3listOfTb4b4b4(T79c0ff1Tb4b4b4, T79c0ff2Tb4b4b4, T79c0ff3Tb4b4b4)

Tff7b72val Te6edf3back Tff7b72= Te6edf3listOfTb4b4b4(T79c0ff3Tb4b4b4, T79c0ff2Tb4b4b4, T79c0ff1Tb4b4b4)

Tff7b72val Te6edf3positioned Tff7b72= Te6edf3setOfTb4b4b4(T79c0ff1Tb4b4b4, T79c0ff3Tb4b4b4)

Tff7b72val Te6edf3result Tff7b72= Te6edf3evaluateTracerouteMapAvailabilityTb4b4b4(Te6edf3forwardTb4b4b4, Te6edf3backTb4b4b4, Te6edf3positionedTb4b4b4)

Te6edf3assertEqualsTb4b4b4(Te6edf3TracerouteMapAvailabilityTb4b4b4.Te6edf3OkTb4b4b4, Te6edf3resultTb4b4b4)

Tb4b4b4}

Tf0883e@Test

Tff7b72fun Td2a8ffmissingEndpoints_whenForwardStartMissingTb4b4b4(Tb4b4b4) Tb4b4b4{

Tff7b72val Te6edf3forward Tff7b72= Te6edf3listOfTb4b4b4(T79c0ff1Tb4b4b4, T79c0ff2Tb4b4b4, T79c0ff3Tb4b4b4)

Tff7b72val Te6edf3back Tff7b72= Te6edf3listOfTb4b4b4(T79c0ff3Tb4b4b4, T79c0ff2Tb4b4b4, T79c0ff1Tb4b4b4)

T8b949e// Node 1 (forward start / back end) is missing from positioned set

Tff7b72val Te6edf3positioned Tff7b72= Te6edf3setOfTb4b4b4(T79c0ff2Tb4b4b4, T79c0ff3Tb4b4b4)

Tff7b72val Te6edf3result Tff7b72= Te6edf3evaluateTracerouteMapAvailabilityTb4b4b4(Te6edf3forwardTb4b4b4, Te6edf3backTb4b4b4, Te6edf3positionedTb4b4b4)

Te6edf3assertEqualsTb4b4b4(Te6edf3TracerouteMapAvailabilityTb4b4b4.Te6edf3MissingEndpointsTb4b4b4, Te6edf3resultTb4b4b4)

Tb4b4b4}

Tf0883e@Test

Tff7b72fun Td2a8ffmissingEndpoints_whenForwardEndMissingTb4b4b4(Tb4b4b4) Tb4b4b4{

Tff7b72val Te6edf3forward Tff7b72= Te6edf3listOfTb4b4b4(T79c0ff1Tb4b4b4, T79c0ff2Tb4b4b4, T79c0ff3Tb4b4b4)

Tff7b72val Te6edf3back Tff7b72= Te6edf3listOfTb4b4b4(T79c0ff3Tb4b4b4, T79c0ff2Tb4b4b4, T79c0ff1Tb4b4b4)

T8b949e// Node 3 (forward end / back start) is missing

Tff7b72val Te6edf3positioned Tff7b72= Te6edf3setOfTb4b4b4(T79c0ff1Tb4b4b4, T79c0ff2Tb4b4b4)

Tff7b72val Te6edf3result Tff7b72= Te6edf3evaluateTracerouteMapAvailabilityTb4b4b4(Te6edf3forwardTb4b4b4, Te6edf3backTb4b4b4, Te6edf3positionedTb4b4b4)

Te6edf3assertEqualsTb4b4b4(Te6edf3TracerouteMapAvailabilityTb4b4b4.Te6edf3MissingEndpointsTb4b4b4, Te6edf3resultTb4b4b4)

Tb4b4b4}

Tf0883e@Test

Tff7b72fun Td2a8ffnoMappableNodes_whenNonePositionedTb4b4b4(Tb4b4b4) Tb4b4b4{

Tff7b72val Te6edf3forward Tff7b72= Te6edf3listOfTb4b4b4(T79c0ff1Tb4b4b4, T79c0ff2Tb4b4b4, T79c0ff3Tb4b4b4)

Tff7b72val Te6edf3back Tff7b72= Te6edf3emptyListTff7b72<Tffa657IntTff7b72>Tb4b4b4(Tb4b4b4)

T8b949e// No node in the routes has a position — but first check endpoints

T8b949e// Endpoints 1 and 3 are missing → MissingEndpoints takes precedence

Tff7b72val Te6edf3positioned Tff7b72= Te6edf3emptySetTff7b72<Tffa657IntTff7b72>Tb4b4b4(Tb4b4b4)

Tff7b72val Te6edf3result Tff7b72= Te6edf3evaluateTracerouteMapAvailabilityTb4b4b4(Te6edf3forwardTb4b4b4, Te6edf3backTb4b4b4, Te6edf3positionedTb4b4b4)

Te6edf3assertEqualsTb4b4b4(Te6edf3TracerouteMapAvailabilityTb4b4b4.Te6edf3MissingEndpointsTb4b4b4, Te6edf3resultTb4b4b4)

Tb4b4b4}

Tf0883e@Test

Tff7b72fun Td2a8ffnoMappableNodes_whenEmptyRoutesTb4b4b4(Tb4b4b4) Tb4b4b4{

T8b949e// Empty routes → no endpoints, no related nodes → NoMappableNodes

Tff7b72val Te6edf3result Tff7b72= Te6edf3evaluateTracerouteMapAvailabilityTb4b4b4(Te6edf3emptyListTb4b4b4(Tb4b4b4)Tb4b4b4, Te6edf3emptyListTb4b4b4(Tb4b4b4)Tb4b4b4, Te6edf3setOfTb4b4b4(T79c0ff1Tb4b4b4, T79c0ff2Tb4b4b4)Tb4b4b4)

Te6edf3assertEqualsTb4b4b4(Te6edf3TracerouteMapAvailabilityTb4b4b4.Te6edf3NoMappableNodesTb4b4b4, Te6edf3resultTb4b4b4)

Tb4b4b4}

Tf0883e@Test

Tff7b72fun Td2a8ffok_whenOnlyForwardRoute_endpointsPositionedTb4b4b4(Tb4b4b4) Tb4b4b4{

T8b949e// Only forward route, no return route

Tff7b72val Te6edf3forward Tff7b72= Te6edf3listOfTb4b4b4(T79c0ff1Tb4b4b4, T79c0ff2Tb4b4b4, T79c0ff3Tb4b4b4)

Tff7b72val Te6edf3back Tff7b72= Te6edf3emptyListTff7b72<Tffa657IntTff7b72>Tb4b4b4(Tb4b4b4)

Tff7b72val Te6edf3positioned Tff7b72= Te6edf3setOfTb4b4b4(T79c0ff1Tb4b4b4, T79c0ff3Tb4b4b4)

Tff7b72val Te6edf3result Tff7b72= Te6edf3evaluateTracerouteMapAvailabilityTb4b4b4(Te6edf3forwardTb4b4b4, Te6edf3backTb4b4b4, Te6edf3positionedTb4b4b4)

Te6edf3assertEqualsTb4b4b4(Te6edf3TracerouteMapAvailabilityTb4b4b4.Te6edf3OkTb4b4b4, Te6edf3resultTb4b4b4)

Tb4b4b4}

Tf0883e@Test

Tff7b72fun Td2a8ffmissingEndpoints_whenReturnRouteEndpointMissingTb4b4b4(Tb4b4b4) Tb4b4b4{

T8b949e// Return route has different endpoints than forward (asymmetric path)

Tff7b72val Te6edf3forward Tff7b72= Te6edf3listOfTb4b4b4(T79c0ff1Tb4b4b4, T79c0ff2Tb4b4b4, T79c0ff3Tb4b4b4)

Tff7b72val Te6edf3back Tff7b72= Te6edf3listOfTb4b4b4(T79c0ff3Tb4b4b4, T79c0ff4Tb4b4b4, T79c0ff1Tb4b4b4)

T8b949e// All forward endpoints (1, 3) are positioned, but checking back endpoints too

T8b949e// back first = 3 (positioned), back last = 1 (positioned) → all endpoints OK

Tff7b72val Te6edf3positioned Tff7b72= Te6edf3setOfTb4b4b4(T79c0ff1Tb4b4b4, T79c0ff3Tb4b4b4)

Tff7b72val Te6edf3result Tff7b72= Te6edf3evaluateTracerouteMapAvailabilityTb4b4b4(Te6edf3forwardTb4b4b4, Te6edf3backTb4b4b4, Te6edf3positionedTb4b4b4)

Te6edf3assertEqualsTb4b4b4(Te6edf3TracerouteMapAvailabilityTb4b4b4.Te6edf3OkTb4b4b4, Te6edf3resultTb4b4b4)

Tb4b4b4}

Tf0883e@Test

Tff7b72fun Td2a8ffdirectRoute_withTwoNodesTb4b4b4(Tb4b4b4) Tb4b4b4{

Tff7b72val Te6edf3forward Tff7b72= Te6edf3listOfTb4b4b4(T79c0ff1Tb4b4b4, T79c0ff2Tb4b4b4)

Tff7b72val Te6edf3back Tff7b72= Te6edf3listOfTb4b4b4(T79c0ff2Tb4b4b4, T79c0ff1Tb4b4b4)

Tff7b72val Te6edf3positioned Tff7b72= Te6edf3setOfTb4b4b4(T79c0ff1Tb4b4b4, T79c0ff2Tb4b4b4)

Tff7b72val Te6edf3result Tff7b72= Te6edf3evaluateTracerouteMapAvailabilityTb4b4b4(Te6edf3forwardTb4b4b4, Te6edf3backTb4b4b4, Te6edf3positionedTb4b4b4)

Te6edf3assertEqualsTb4b4b4(Te6edf3TracerouteMapAvailabilityTb4b4b4.Te6edf3OkTb4b4b4, Te6edf3resultTb4b4b4)

Tb4b4b4}

Tb4b4b4}